#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int _279(int n)
{
    vector<int> dp(n + 1, INT_MAX);
    dp[0] = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j * j <= i; j++)
        {
            dp[i] = min(dp[i], dp[i - j * j] + 1);
        }
    }
    return dp[n];
}

int main()
{
    cout << _279(12) << endl;
    return 0;
}